168B - Wizards and Minimal Spell - CodeForces Solution

implementation strings *1700

Please click on ads to support us..

Python Code: 

import sys

whitespaces = ('\n', '\t', ' ')

def parse_line(line, previous_is_amplifying, is_last_line):
	line_buff = []
	amplifying = False
	for idx, c in enumerate(line):
		if c in whitespaces:
			line_buff.append(c)
		else:
			amplifying = (c == '#')
			break
	if not amplifying:
		line_buff = []
	for i in range(idx, len(line)):
		if line[i] in whitespaces:
			if amplifying:
				line_buff.append(line[i])
		else:
			line_buff.append(line[i])
					if amplifying and is_last_line and line_buff[-1] == '\n':
		line_buff.pop()
	if not previous_is_amplifying and amplifying:
		return '\n' + ''.join(line_buff), amplifying
	return ''.join(line_buff), amplifying
			
lines = sys.stdin.readlines()
out = []
prev = True
for i, line in enumerate(lines):
	is_last_line = (i == len(lines)-1)
	parsed_line, prev = parse_line(line, prev, is_last_line)
	out.append(parsed_line)
print(''.join(out))

C++ Code: 

#include <bits/stdc++.h>

using namespace std;

int main() {
	string str;

    string line = "";

	bool b = false;

	while (getline(cin, str)) {
		bool good = 0;

		for (int i = 0; i < str.length(); i++) {
			if (str[i] != '#' && str[i] != ' ') {
				break;
			}
			else if (str[i] == '#') {
				good = 1;
				break;
			}
		}

        if (good) {
			if (b) {
				cout << line << "\n";
				line = "";
				b = 0;
			}

			cout << str << "\n";
		}
        else {
            b = 1;
            for (int i = 0; i < str.length(); i++) {
				if (str[i] != ' ') {
					line += str[i];
				}
			}
        }
	}

    if (b) cout << line << "\n";
}/*1692060396.4044921*/


Comments

Submit
0 Comments
More Questions

561. Array Partition I
1374. Generate a String With Characters That Have Odd Counts
1822. Sign of the Product of an Array
1464. Maximum Product of Two Elements in an Array
1323. Maximum 69 Number
832. Flipping an Image
1295. Find Numbers with Even Number of Digits
1704. Determine if String Halves Are Alike
1732. Find the Highest Altitude
709. To Lower Case
1688. Count of Matches in Tournament
1684. Count the Number of Consistent Strings
1588. Sum of All Odd Length Subarrays
1662. Check If Two String Arrays are Equivalent
1832. Check if the Sentence Is Pangram
1678. Goal Parser Interpretation
1389. Create Target Array in the Given Order
1313. Decompress Run-Length Encoded List
1281. Subtract the Product and Sum of Digits of an Integer
1342. Number of Steps to Reduce a Number to Zero
1528. Shuffle String
1365. How Many Numbers Are Smaller Than the Current Number
771. Jewels and Stones
1512. Number of Good Pairs
672. Richest Customer Wealth
1470. Shuffle the Array
1431. Kids With the Greatest Number of Candies
1480. Running Sum of 1d Array
682. Baseball Game
496. Next Greater Element I